The combinatorial (19_4) configurations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On topological and geometric $(19_4)$ configurations

An (nk) configuration is a set of n points and n lines such that each point lies on k lines while each line contains k points. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines, or just combinatorial lines. The existence and enumeration of (nk) configurations for a given k has been subject to active research...

متن کامل

The semigroup of combinatorial configurations

A (v, b, r, k) combinatorial configuration is a (r, k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some cryptographic applications to sensor networks and to peerto-peer communities. Configurable tuples are those tuples (v, b, r, k) for which a (v, b, r, k) combinatori...

متن کامل

Local configurations in discrete combinatorial surfaces

Representing discrete objects by polyhedral complexes, we can define all conceivable topological characteristics of points in discrete objects, namely those of vertices of polyhedral complexes. Such a topological characteristic is determined for each point by observing a configuration of object points in the 3 × 3 × 3 local point set of its neighbors. We study a topological characteristic such ...

متن کامل

Testing Django Configurations Using Combinatorial Interaction Testing

Combinatorial Interaction Testing (CIT) is important because it tests the interactions between the many parameters that make up the configuration space of software systems. We apply this testing paradigm to a Python-based framework for rapid development of webbased applications called Django. In particular, we automatically create a CIT model for Django website configurations and run a state-of...

متن کامل

On the Combinatorial Classification of Nondegenerate Configurations in the Plane

We classify nondegenerate plane configurations by attaching, to each such configuration of n points, a periodic sequence of permutations of { 1,2,..., n} which satisfies some simple conditions; this classification turns out to be appropriate for questions involving convexity. In 1881 Perrin stated that every sequence satisfying these conditions was the image of some plane configuration. We show...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2012

ISSN: 1855-3974,1855-3966

DOI: 10.26493/1855-3974.216.59d